Agglomerative Hierarchical Approach for Clustering Components of Similar Reusability
نویسندگان
چکیده
This paper presents a clustering approach for grouping components of similar reusability using an already worked out fuzzy data set [2]. Research has shown that, component based systems development concept benefits the object oriented software development. A Component based system achieves flexibility by clearly separating the stable parts of systems from the specification of their composition. Many software systems contain many similar or even identical components and these components are developed from scratch over and over again which require extra effort. So to minimize the extra effort in developing these components, it is more beneficial to reuse the existing components. To reuse components effectively in Component Based Software Development, it is required to quantify the reusability of components. However it is difficult to use clustering approach to predict reusability. This paper discusses a technique to cluster components of similar reusability together for the purpose of minimizing the efforts of the developer using agglomerative hierarchical clustering. Components attribute affecting the reusability are classified into rules using fuzzy system and are then taken as the inputs to the proposed clustering model.
منابع مشابه
Interpreting and Extending Classical Agglomerative Clustering Algorithms using a Model-Based approach
We present two results which arise from a model-based approach to hierarchical agglomerative clustering. First, we show formally that the common heuristic agglomerative clustering algorithms – Ward’s method, single-link, complete-link, and a variant of group-average – are each equivalent to a hierarchical model-based method. This interpretation gives a theoretical explanation of the empirical b...
متن کاملImplementing Agglomerative hierarchical clustering using multiple attribute
Agglomerative hierarchical clustering algorithm used with top down approach. It implement with multiple attributes. In multiple attributes frequency calculation is allocated. Memory requirements are less in this process. Hierarchical clustering produce accurate result than any other algorithm. This is very less time consuming process.
متن کاملA Relative Approach to Hierarchical Clustering
This paper presents a new approach to agglomerative hierarchical clustering. Classical hierarchical clustering algorithms are based on metrics which only consider the absolute distance between two clusters, merging the pair of clusters with highest absolute similarity. We propose a relative dissimilarity measure, which considers not only the distance between a pair of clusters, but also how dis...
متن کاملAgglomerative Clustering of Bagged Data Using Joint Distributions
Current methods for hierarchical clustering of data either operate on features of the data or make limiting model assumptions. We present the hierarchy discovery algorithm (HDA), a model-based hierarchical clustering method based on explicit comparison of joint distributions via Bayesian network learning for predefined groups of data. HDA works on both continuous and discrete data and offers a ...
متن کاملA Comparative Agglomerative Hierarchical Clustering Method to Cluster Implemented Course
There are many clustering methods, such as hierarchical clustering method. Most of the approaches to the clustering of variables encountered in the literature are of hierarchical type. The great majority of hierarchical approaches to the clustering of variables are of agglomerative nature. The agglomerative hierarchical approach to clustering starts with each observation as its own cluster and ...
متن کامل